双面金属包覆介质波导模序数的判别方法

在双面金属包覆介质波导中 ,随着介质层厚度的变化 ,会出现TM0 模与TM1 模的分离和简并两种状态 ,从而影响衰减全反射 (ATR)谱中模序数的确认。通过对金属波导的理论分析和实验研究 ,提出了三种模序数确认方法 :本征角计算法、吸收峰全峰半宽比较法和吸收峰峰间距比较法 ,实现了两种状态下对模序数的准确判断     

一类新的表面活性剂——长链烷基三苯基鏻——Ⅵ.稳态荧光猝灭法测定十二烷基三苯基溴化鏻胶束的平均簇集数

研究了十二烷基三苯基溴化鏻(C_(12)PBr)胶束中N,N-二甲基苯胺(DMA)和二苯甲酮(DPK)对芘的荧光猝灭,发现DMA的猝灭行为不符合Stern-Volmer动态猝灭和Turro静态猝灭模型;DPK的猝灭行为不符合Stern-Volmer猝灭模型,但遵从Turro静态猝灭模型。根据DPK的静态猝灭性质测得C_(12)PBr胶束的平均簇集数为15士2,并相应地得到C_(12)PBr的临界胶束浓度为(1.77±0.09)×10~(-3)mol/L,后者与文献值一致。     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

总延误问题顺时安排法的性能比

给定一组工件的加工时间与工期，要求确定这些工件在一台机器上的加．工排列，使相应的总延误达到最小，这就是总延误问题．该问题在近年已被证明是NP困难的．由Wilkermn和Irwin（1971），林勋（1983）等所研究的顺时安排法能得到相邻交换意义下的局部解．在本文中，我们进一步证明该算法能得到前移邻域意义下的局部解，并确定了该算法的性能比．     

关于紧优双环网络的无限族

双环网络是计算机互连网络和通讯系统的一类重要拓扑结构．1993年,李乔等人提出一个系统的构造方法,构造出69类0紧优和33类1紧优双环网络的无限族,并提出研究下述问题:求k(k>1)紧优双环网络的无限族．2003年,徐俊明等人给出一个4紧优双环网络的无限族．本文首先证明从每一个具体的0紧优双环网络出发,都可以构造若干0紧优双环网络无限族;结合同余方程组理论和数论中的素数理论,给出若干求一般k(k≥0)紧优双环网络无限族(包括非单位步长双环网络无限族)的方法．     

Metallic radii of nonmetals

Experimental data are used to determine the atomic volumes and radii of the elements of subgroups IV–VIIA in the structures of metallic phases at high pressures. Metallic radii of nonmetals are compared with values based on Pauling and Goldschmidt calculations.Translated fromIzvestiya Akademii Nauk. Seriya Khimicheskaya, No. 2, pp. 220–222, February, 1994.     

几类数列通项的矩阵求法

本利用矩阵给出了几类数列的通项公式的求法，把数列通项公式的求法转化为矩阵幂的计算，思路简单、计算简便，并能判别其敛散性。     

Photoelastic stress freezing analysis of total shoulder replacement systems

Photoelastic stress freezing analyses in the orthopaedic literature have, in the past, been limited to studies where bone-on-bone, bone-on-metal or ultra-high molecular weight polyethylene (UHMWPE)-on-metal constructs are modeled. In these cases photoelastic plastics are used to simulate either bone or UHMWPE as it interacts with a metal implant. In joints such as the shoulder, a UHMWPE component is often cemented directly into the scapula's glenoid concavity using polymethylmethacrylate (PMMA). While a photoelastic material can be used to simulate bone with proper load scaling, UHMWPE and PMMA have very different mechanical properties at elevated stress freezing temperatures as compared within vivo body temperature. In this study, materials were identified such that proper scaling of elastic properties at elevated temperatures was utilized to simulate the metal-UHMWPE-PMMA-bone construct. Stresses on orthogonal planes throughout the glenoid were compared for two different UHMWPE component anchoring geometries (keeled and pegged). High stresses were found at the neck of the glenoid and also at the component-bone interface beneath simulated PMMA inclusions.     

Linear Ramsey numbers of sparse graphs

The Ramsey number R(G₁,G₂) of two graphs G₁ and G₂ is the least integer p so that either a graph G of order p contains a copy of G₁ or its complement G^c contains a copy of G₂. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Chromatic Uniqueness of the Complement of T_m(l, 4, m - 6)

In the paper, we prove that the complement of Tm(1,4,m - 6)(m > 10) is chromatically unique if and only if m ≠5k(k ≥ 2).